/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package com.srcptit.trainning.b1;

import java.util.Scanner;

/**
 *
 * @author Administrator
 */
public class B4_LietKeNSoNguyenTo {
    public static void main(String[] args) {
        int n;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        lietKe(n);
    }
    static boolean isPrime(int n){
        if(n<2) return false;
        if(n==2) return true;
        if(n%2==0) return false;
        for(int i=3;i<=(int)Math.sqrt(n);i+=2)
            if(n%i==0) return false;
        return true;
    }
    static void lietKe(int n){
        if(n==0) return;
        System.out.print(n+" số nguyên tố đầu tiên là: 2");
        int i = 3;
        while(n>1){
            if(isPrime(i)){
                System.out.print(" "+i);
                n--;
            }
            i+=2;
        }
        System.out.println("");
    }
}
